Reduced Clustering Method Based on the Inversion Formula Density Estimation

نویسندگان

چکیده

Unsupervised learning is one type of machine with an exceptionally high number applications in various fields. The most popular and best-known group unsupervised methods clustering methods. main goal to find hidden relationships between individual observations. There great interest different density estimation methods, especially when there are outliers the data. Density also can be applied data This paper presents extension method based on modified inversion formula solve previous limitations. new method’s works within higher dimensions (d > 15) cases, which was limitation method. More than 20 sets used comparative analysis prove effectiveness developed improvement. results showed that positively affects results. reduced method, estimation, outperforms test sets. In cases accuracy not best, close best models’ obtained accuracies. Lower dimensionality were compare standard extended modification has better all confirmed hypothesis about positive impact

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LASERS WITHOUT INVERSION: DENSITY OPERATOR METHOD

A quantum theory of a two and three-level laser with injected atomic coherence is developed by using a density operator method, to the best of our knowledge, for the first time. The initial atomic coherence plays an essential role. At steady state, the equation of motion for the density operator yields to exhibit laser without inversion and a phase locking but no threshold for the laser fie...

متن کامل

DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation

The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assigned to clusters by hill climbing, i.e. points going to the same local maximum are put into the same cluster. A disadvantage of Denclue 1.0 is, that the used hill climbing may make unnecessary small steps in the beginnin...

متن کامل

An improved method for density-based clustering

Knowledge discovery in large multimedia databases which usually contain large amounts of noise and high-dimensional feature vectors is an increasingly important research issue. Density-based clustering is proved to be much more efficient when dealing with such databases. However, its clustering quality mainly depends on the parameter setting. For the adequate choice of the parameters to be pres...

متن کامل

Self-adaptive Trajectory Prediction Method Based on Density Clustering

To solve the problem of user trajectory prediction in the mobile communication environment, we proposed a self-adaptive trajectory prediction method (ATPDC) based on density clustering. And it consists of two stages which are trajectory modeling stage and trajectory updating stage respectively. In the first stage, it constructs the user trajectory prediction model by clustering historical traje...

متن کامل

A Trajectory Data Clustering Method Based On Dynamic Grid Density

Under the traditional method of frequent trajectory mining, the location of data is obtained through the GPS device. However, limited equipment accuracy may incur location ambiguity. In this paper, we propose a new trajectory data clustering method based on dynamic grid density, in order to remove this ambiguity. In this method, the trajectory space of an object is firstly divided into equal-si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11030661